Qf Functors and (co)monads

نویسندگان

  • BACHUKI MESABLISHVILI
  • ROBERT WISBAUER
  • F. Kasch
  • T. Nakayama
چکیده

One reason for the universal interest in Frobenius algebras is that their characterisation can be formulated in arbitrary categories: a functor K : A → B between categories is Frobenius if there exists a functor G : B → A which is at the same time a right and left adjoint of K; a monad F on A is a Frobenius monad provided the forgetful functor AF → A is a Frobenius functor, where AF denotes the category of F -modules. With these notions, an algebra A over a field k is a Frobenius algebra if and only if A ⊗k − is a Frobenius monad on the category of k-vector spaces. The purpose of this paper is to find characterisations of quasi-Frobenius algebras by just referring to constructions available in any categories. To achieve this we define QF functors between two categories by requiring conditions on pairings of functors which weaken the axioms for adjoint pairs of functors. QF monads on a category A are those monads F for which the forgetful functor UF : AF → A is a QF functor. Applied to module categories (or Grothendieck categories), our notions coincide with definitions first given K. Morita (and others). Further applications show the relations of QF functors and QF monads with Frobenius (exact) categories.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Regular Pairings of Functors and Weak (co)monads

For functors L : A→ B and R : B→ A between any categories A and B, a pairing is defined by maps, natural in A ∈ A and B ∈ B, MorB(L(A), B) α // MorA(A,R(B)) β oo . (L,R) is an adjoint pair provided α (or β) is a bijection. In this case the composition RL defines a monad on the category A, LR defines a comonad on the category B, and there is a well-known correspondence between monads (or comonad...

متن کامل

Predicate Logic for Functors and Monads

This paper starts from the elementary observation that what is usually called a predicate lifting in coalgebraic modal logic is in fact an endomap of indexed categories. This leads to a systematic review of basic results in predicate logic for functors and monads, involving induction and coinduction principles for functors and compositional modal operators for monads.

متن کامل

Monads in double categories

Introduction The development of the formal theory of monads, begun in [23] and continued in [15], shows that much of the theory of monads [1] can be generalized from the setting of the 2-category Cat of small categories, functors and natural transformations to that of a general 2-category. The generalization, which involves defining the 2-category Mnd(K) of monads, monad maps and monad 2-cells ...

متن کامل

Polynomial and Analytic Functors and Monads, revisited

We describe an abstract 2-categorical setting to study various notions of polynomial and analytic functors and monads.

متن کامل

Constructing Applicative Functors

Applicative functors define an interface to computation that is more general, and correspondingly weaker, than that of monads. First used in parser libraries, they are now seeing a wide range of applications. This paper sets out to explore the space of non-monadic applicative functors useful in programming. We work with a generalization, lax monoidal functors, and consider several methods of co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012